Preemptive scheduling in a two-stage supply chain to minimize the makespan

نویسندگان

  • Jun Pei
  • Wenjuan Fan
  • Panos M. Pardalos
  • Xinbao Liu
  • Boris Goldengorin
  • Shanlin Yang
چکیده

Preemptive scheduling in a two-stage supply chain to minimize the makespan Jun Pei, Wenjuan Fan, Panos M. Pardalos, Xinbao Liu, Boris Goldengorin & Shanlin Yang a School of Management, Hefei University of Technology, Hefei, People's Republic of China b Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA c Department of Computer Science, North Carolina State University, Raleigh, NC, USA d Key Laboratory of Process Optimization and Intelligent Decisionmaking of Ministry of Education, Hefei, People's Republic of China e Department of Operations Management & Operations Research, University of Groningen, Groningen, The Netherlands Accepted author version posted online: 01 Oct 2014.Published online: 11 Nov 2014.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling and Solution Procedure for a Preemptive Multi-Objective Multi-Mode Project Scheduling Model in Resource Investment Problems

In this paper, a preemptive multi-objective multi-mode project scheduling model for resource investment problem is proposed. The first objective function is to minimize the completion time of project (makespan);the second objective function is to minimize the cost of using renewable resources. Non-renewable resources are also considered as parameters in this model. The preemption of activities ...

متن کامل

A branch and bound algorithm to minimize the total weighted number of tardy jobs and delivery costs with late deliveries for a supply chain scheduling problem

In this paper, we study a supply chain scheduling problem that simultaneously considers production scheduling and product delivery.  jobs have to be scheduled on a single machine and delivered to  customers for further processing in batches. The objective is to minimize the sum of the total weighted number of tardy jobs and the delivery costs. In this paper, we present a heuristic algorithm (HA...

متن کامل

A Genetic Algorithm Developed for a Supply Chain Scheduling Problem

This paper concentrates on the minimization of total tardiness and earliness of orders in an integrated production and transportation scheduling problem in a two-stage supply chain. Moreover, several constraints are also considered, including time windows due dates, and suppliers and vehicles availability times. After presenting the mathematical model of the problem, a developed version of GA c...

متن کامل

Integrated Process Planning and Active Scheduling in a Supply Chain-A Learnable Architecture Approach

Through the lens of supply chain management, integrating process planning decisions and scheduling plans becomes an issue of great challenge and importance. Dealing with the problem paves the way to devising operation schedules with minimum makespan; considering the flexible process sequences, it can be viewed as a fundamental tool for achieving the scheme, too. To deal with this integration, t...

متن کامل

Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates

This paper is concerned with the problem of scheduling preemptive tasks subject to precedence constraints in order to minimize the maximum lateness and the makespan. The number of available parallel processors is allowed to vary in time. It is shown that when an Earliest Due Date rst algorithm provides an optimal nonpreemptive schedule for unit-execution-time (UET) tasks, then the preemptive pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Optimization Methods and Software

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2015